Termination Analysis of Integer Linear Loops
نویسندگان
چکیده
program: uint x, y Θ : x > 0 ∧ x%2 = 0 τ1 : x%3 = 0 ∧ x ′ = x − 2 ∧ y′ = y τ2 : x%3 6= 0 ∧ x ′ = x − x 2 ∧ y′ = y τ3 : y > x ∧ y ′ = y − x ∧ x′ = x
منابع مشابه
Termination of Integer Linear Programs
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integers in the homogeneous case, and over the rationals in the general case. This is done by analyzing the powers of a matrix symbolically using its eigenvalues. Our results generalize the work of Tiwari [Tiw04], where si...
متن کاملProving Termination Through Conditional Termination
We present a constraint-based method for proving conditional termination of integer programs. Building on this, we construct a framework to prove (unconditional) program termination using a powerful mechanism to combine conditional termination proofs. Our key insight is that a conditional termination proof shows termination for a subset of program execution states which do not need to be consid...
متن کاملOn Termination of Integer Linear Loops
A fundamental problem in program verification concerns the termination of simple linear loops of the form: x← u ; while Bx ≥ c do x← Ax+ a , where x is a vector of variables, u, a, and c are integer vectors, and A and B are integer matrices. Assuming the matrix A is diagonalisable, we give a decision procedure for the problem of whether, for all initial integer vectors u, such a loop terminates...
متن کاملTermination of Loop Programs with Polynomial Guards
Termination analysis of loop programs is very important in many applications, especially in those of safety critical software. In this paper, the termination of programs with polynomial guards and linear assignments is simplified to decide solvability of semi-algebraic systems(SAS). If the number of functions are finite or the functions are integer periodic, then the termination of programs is ...
متن کاملProgram Analysis: Termination Proofs for Linear Simple Loops
Termination proof synthesis for simple loops, i.e., loops with only conjoined constraints in the loop guard and variable updates in the loop body, is the building block of termination analysis, as well as liveness analysis, for large complex imperative systems. In particular, we consider a subclass of simple loops which contain only linear constraints in the loop guard and linear updates in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005